Unbalanced Hadamard Matrices and Finite Projective Planes of Even Order

نویسنده

  • K. A. Bush
چکیده

By an unbalanced Hadamard matrix we mean a matrix H,, = (hii) such that (i) hii = l/fi or -I/fi, (ii) H, is orthogonal, and (iii) the number of positive entries exceeds the number of negative entries in each row. In particular it is well-known that the dimension n must be an even perfect square if the number of positive entries is the same in each row. It is easy to show that the number of positive entries is 2t’ + t in this case. It is this case which is of interest to us, and we accordingly agree that n = 4t2 and omit future reference to the dimensionality of II. An elementary proof of these statements appears in [7]. By a finite projective plane of order 2t we mean a collection of 4t2 + 2t + 1 objects called points divided into subclasses called lines such that each subclass contains 2t + 1 points, and any two subclasses have precisely one point in common. Thus two lines define a point, and the dual, two points determine a line, also holds. An extensive literature has grown up on this subject since the topic was first explored in [8]. The leading theorems about finite projective planes concern the question of existence of such planes. We have the classic result: if the order is a prime or a power of prime, the geometry exists established in [I]. We also have the now celebrated Bruck-Ryser theorem [5] stating that, if the order s = 1 or 2 (4) and if the decomposition of s contains a prime of the form 4k + 3 to an odd power, then the finite projective plane fails to exist. Despite strenuous efforts and much computer time, no further progress has been made with this fundamental question. As a result, two schools have arisen, one faction believing that finite projective planes exist in all cases not excluded by the Bruck-Ryser conditions while others conjecture that such planes exist only if s is a power of a prime or a prime. The former position was somewhat strengthened by the remarkable discovery

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supplementary difference sets and optimal designs

D-optimal designs of order n = 2v ≡ 2 (mod 4), where q is a prime power and v = q2 + q + 1 are constructed using two methods, one with supplementary difference sets and the other using projective planes more directly. An infinite family of Hadamard matrices of order n = 4v with maximum excess (n) = n√n 3 where q is a prime power and v = q2 + q + 1 is a prime, is also constructed. Disciplines Ph...

متن کامل

Balanced Generalized Weighing Matrices and their Applications

Balanced generalized weighing matrices include well-known classical combinatorial objects such as Hadamard matrices and conference matrices; moreover, particular classes of BGW -matrices are equivalent to certain relative difference sets. BGW -matrices admit an interesting geometrical interpretation, and in this context they generalize notions like projective planes admitting a full elation or ...

متن کامل

Computational Strategies for the Generation of Equivalence Classes of Hadamard Matrixes

Hadamard matrices are useful in Hadamard transform spectroscopy and in the construction of optimal chemical designs.'-8 The use of these matrices in spectroscopy has led to the advent of Hadamard transform spectroscopy3 which employs spectroscopic multiplexing techniques and is a powerful tool for the analysis of complex spectra. Besides Hadamard matrices are useful in chemical designs and bloc...

متن کامل

On Some Quaternary Self-Orthogonal Codes

This paper studies families of self-orthogonal codes over Z4. We show that the simplex codes (Type α and Type β) are self-orthogonal. We partially answer the question of Z4-linearity for the codes from projective planes of even order. A new family of self-orthogonal codes over Z4 is constructed via projective planes of odd order. Properties such as shadow codes, self-orthogonality, weight distr...

متن کامل

Berlekamp's Switching Game on Finite Projective and Affine Planes

We adapt Berlekamp’s light bulb switching game to finite projective plans and finite affine planes, then find the worst arrangement of lit bulbs for planes of even and odd orders. The results are then extended from the planes to spaces of higher dimension. 1 Berlekamp’s Switching Game The original game is simple enough. 100 light bulbs arranged in 10 rows and 10 columns. Each column and row has...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 11  شماره 

صفحات  -

تاریخ انتشار 1971